A New Trade-off for Deterministic Dictionaries
نویسندگان
چکیده
منابع مشابه
A New Trade-Off for Deterministic Dictionaries
We consider dictionaries over the universe U = {0, 1} on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with membership queries in time (log logn) and updates in time (logn), where n is the size of the set stored. This is the first such data structure to simultaneously achieve query time (logn) and update time O(2 c ) for a co...
متن کاملA Trade-Off for Worst-Case Efficient Dictionaries
We consider dynamic dictionaries over the universe U = f0; 1g on a unit-cost RAM with word size w and a standard instruction set, and present a linear space deterministic dictionary accommodating membership queries in time (log logn) and updates in time (logn), where n is the size of the set stored. Previous solutions either had query time (logn) (1) or update time 2 p log n) in the worst case....
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملDeterministic Dictionaries
It is shown that a static dictionary that offers constant-time access to n elements with w-bit keys and occupies O(n) words of memory can be constructed deterministically in O(n log n) time on a unit-cost RAM with word length w and a standard instruction set including multiplication. Whereas a randomized construction working in linear expected time was known, the running time of the best previo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2000
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v7i4.20132